Section: Software

FO-CTL($R_{\text{lin}}$), first-order computation tree logic over the reals

Participants : François Fages, Thierry Martinez.

FO-CTL($R_{\text{lin}}$) is a solver for full First-Order Computation Tree Logic with linear arithmetic over the reals in constrained transition systems (CTS). CTS are transition systems where both states and transitions are described with constraints. FO-CTL($R_{\text{lin}}$) generalizes the implementation done in Biocham of LTL($R_{\text{lin}}$) for linear traces to branching Kripke structure.